Performance of K-means algorithm based an ensemble learning

نویسندگان

چکیده

K-means is an iterative algorithm used with clustering task. It has more characteristics such as simplicity. In the same time, it suffers from some of drawbacks, sensitivity to initial centroid values that may produce bad results, they are based on centroids clusters would be selected randomly. More suggestions have been given in order overcome this problem. Ensemble learning a method clustering; multiple runs executed different results for data set. Then final driven. According hypothesis, ensemble techniques suggested deal One these "Three ways method". However, paper, three technique merged k-mean improve its performance and reduce impact results. was compared traditional k-means through practical work using popular The evaluation hypothesis done computing related metrics.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm

Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...

متن کامل

persistent k-means: stable data clustering algorithm based on k-means algorithm

identifying clusters or clustering is an important aspect of data analysis. it is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. it is a main task of exploratory data mining, and a common technique for statistical data analysis this paper proposed an improved version of k-means algorithm, namely persistent k...

متن کامل

Genetic Algorithm Based K-Means Fast Learning Artificial Neural Network

The K-means Fast Learning Artificial Neural Network (KFLANN) is a small neural network bearing two types of parameters, the tolerance, δ and the vigilance, μ. In previous papers, it was shown that the KFLANN was capable of fast and accurate assimilation of data [12]. However, it was still an unsolved issue to determine the suitable values for δ and μ in [12]. This paper continues to follows-up ...

متن کامل

K+ Means : An Enhancement Over K-Means Clustering Algorithm

K-means (MacQueen, 1967) [1] is one of the simplest unsupervised learning algorithms that solve the well-known clustering problem. The procedure follows a simple and easy way to classify a given data set to a predefined, say K number of clusters. Determination of K is a difficult job and it is not known that which value of K can partition the objects as per our intuition. To overcome this probl...

متن کامل

An Improved K-means Algorithm based on Mapreduce and Grid

The traditional K-means clustering algorithm is difficult to initialize the number of clusters K, and the initial cluster centers are selected randomly, this makes the clustering results very unstable. Meanwhile, algorithms are susceptible to noise points. To solve the problems, the traditional K-means algorithm is improved. The improved method is divided into the same grid in space, according ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of Electrical Engineering and Informatics

سال: 2022

ISSN: ['2302-9285']

DOI: https://doi.org/10.11591/eei.v11i1.3550